Comparison of interval methods for plotting algebraic curves

نویسندگان

  • Ralph R. Martin
  • Huahao Shou
  • Irina Voiculescu
  • Adrian Bowyer
  • Guojin Wang
چکیده

This paper compares the performance and efficiency of different function range interval methods for plotting f(x, y) = 0 on a rectangular region based on a subdivision scheme, where f(x, y) is a polynomial. The solution of this problem has many applications in CAGD. The methods considered are interval arithmetic methods (using the power basis, Bernstein basis, Horner form and centred form), affine arithmetic method, Bernstein coefficient method, Taubin’s method, Rivlin’s method, Gopalsamy’s method, and related methods which also take into account derivative information. Our experimental results show that the affine arithmetic method, interval arithmetic using centred form method, the Bernstein coefficient method, Taubin’s method, Rivlin’s method, and their related derivative methods have similar performance, and generally they are more accurate and efficient than Gopalsamy’s method and interval arithmetic using the power basis, the Bernstein basis, and Horner form methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Recursive Taylor Method for Algebraic Curves and Surfaces

This paper examines recursive Taylor methods for multivariate polynomial evaluation over an interval, in the context of algebraic curve and surface plotting as a particular application representative of similar problems in CAGD. The modified affine arithmetic method (MAA), previously shown to be one of the best methods for polynomial evaluation over an interval, is used as a benchmark; experime...

متن کامل

Algebraic curves in parallel coordinates - avoiding the "over-plotting" problem

Until now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point ↔ line duality. The result is a " line-curve " which is seen as the envelope of it's tangents. Usually this gives an unclear image and is at the heart of the " over-plotting " problem; a barrier in the effective use of Parallel Coordinates. This problem is overcome by a transformation whi...

متن کامل

Modified Affine Arithmetic in Tensor Form for Trivariate Polynomial Evaluation and Algebraic Surface Plotting ⋆

This paper extends the modified affine arithmetic in matrix form method for bivariate polynomial evaluation and algebraic curve plotting in 2D to modified affine arithmetic in tensor form for trivariate polynomial evaluation and algebraic surface plotting in 3D. Experimental comparison shows that modified affine arithmetic in tensor form is not only more accurate but also much faster than stand...

متن کامل

Algebraic pruning: a fast technique for curve and surface intersection

Computing the intersection of parametric and algebraic curves and surfaces is a fun damental problem in computer graphics and geometric modeling This problem has been extensively studied in the literature and di erent techniques based on subdivision interval analysis and algebraic formulation are known For low degree curves and surfaces algebraic methods are considered to be the fastest whereas...

متن کامل

Modified Affine Arithmetic in Tensor Form ⋆

This paper extends the modified affine arithmetic in matrix form method for bivariate polynomial evaluation and algebraic curve plotting in 2D to modified affine arithmetic in tensor form for trivariate polynomial evaluation and algebraic surface plotting in 3D. Experimental comparison shows that modified affine arithmetic in tensor form is not only more accurate but also much faster than affin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2002